Synthesizing Pareto Efficient Intelligible State Machines from Communication Diagram

Synthesizing Communication Processors from Timing Diagram Specifications

Synthesizing Interacting Finite State Machines

We present a mathematical framework for analyzing the synthesis of interacting finite state systems. The logic S1S is used to derive simple, rigorous, and constructive solutions to problems in sequential synthesis. We obtain exact and approximate sets of permissible FSM network behavior, and address the issue of FSM realizability. This approach is also applied to synthesizing systems with fairn...

From Communication Histories to State Transition Machines

The black-box view of an interactive component concentrates on the input/output behaviour based on communication histories. The glass-box view discloses the component’s internal state with inputs effecting an update of the state. The black-box view is modelled by a stream processing function, the glass-box view by a state transition machine. We present a formal method for transforming a stream ...

Communication in Abstract State Machines

Up to recently the majority of applications of the Abstract State Machines method for design and verification of computational systems used the shared variable approach. However in particular with distributed systems only various forms of communication may be available to share information. We define communicating ASMs by using instead of shared locations an explicit, abstract concept of Sendin...

Logichart - Intelligible Program Diagram for Prolog and its Processing System

An intelligible program diagram called Logichart has been developed for Prolog visualization. Its syntax rules and layout rules are formalized in terms of an attribute graph grammar. This grammar consists of a context–free graph grammar whose productions are defined in such a way as to formalize the graph–syntax rules of Logichart diagrams, and semantic rules which are defined in such a way tha...